Generalized Index-Set Splitting

نویسندگان

  • Christopher Barton
  • Arie Tal
  • Bob Blainey
  • José Nelson Amaral
چکیده

This paper introduces Index-Set Splitting (ISS), a technique that splits a loop containing several conditional statements into several loops with less complex control flow. Contrary to the classic loop unswitching technique, ISS splits loops when the conditional is loop variant. ISS uses an Index Sub-range Tree (IST) to identify the structure of the conditionals in the loop and to select which conditionals should be eliminated. This decision is based on an estimation of the code growth for each splitting: a greedy algorithm spends a pre-determined code growth budget. ISTs separate the decision about which splits to perform from the actual code generation for the split loops. The use of ISS to improve a loop fusion framework is then discussed. ISS opportunity identification in the SPEC2000 benchmark suite and three other suites demonstrate that ISS is a general technique that may benefit other compilers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model

In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...

متن کامل

New Type of Matrix Splitting and Its Applications

One possible type of the matrix splitting is introduced. Using this matrix splitting, we introduce a few properties and representations of generalized inverses as well as iterative methods for computing various solutions of singular linear systems. This matrix splitting is a generalization of the known index splitting from [13] and a proper splitting from [4]. Using a generalization of the cond...

متن کامل

A Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

متن کامل

New Generalized Interval Valued Intuitionistic Fuzzy Numbers

The aim of this paper is investigate the notion of a generalized interval valued intuitionistic fuzzy number (GIVIFN), which extends the interval valuedintuitionistic fuzzy number. Firstly, the concept of GIVIFNBs is introduced.Arithmetic operations and cut sets over GIVIFNBBs are investigated. Then the values and ambiguities of the membership degree and the non-membership degree and the value ...

متن کامل

Splittings of Operators and Generalized Inverses

In this paper we extend the notion of the proper splitting of rectangular matrices introduced and investigated in ( Berman, A. and Neumann, M., SIAM J. Appl. Math. 31 (1976), 307–312; and Berman, A. and Plemmons, R. J., SIAM J. Numer. Anal. 11 (1974), 145–154) to g-invertible operators on Banach spaces. Also, we extend and generalize the notion of the index splitting of square matrices introduc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005